package person.bing.fbcloud.leetcode;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

/**
 * @author: mengfanbing
 * @date: 2020/9/15 9:31
 */
public class Q37 {
    public static void main(String[] args) {

    }
    public static void solveSudoku(char[][] board) {
//        map的key有三部分组成坐标和9块的标号
        Map<String,Set> map = new HashMap<>();
        Set<Integer> set1 = new HashSet<>();
        Set<Integer> set2 = new HashSet<>();
        Set<Integer> set3 = new HashSet<>();
        Set<Integer> set4 = new HashSet<>();
        Set<Integer> set5 = new HashSet<>();
        Set<Integer> set6 = new HashSet<>();
        Set<Integer> set7 = new HashSet<>();
        Set<Integer> set8 = new HashSet<>();
        Set<Integer> set9 = new HashSet<>();
        int row = board.length;
        int col = board[0].length;
        for (int i=0;i<row;i++){
            for (int j=0;j<col;j++){
                char value = board[i][j];

            }
        }
    }
}
